CORPS: Building a Community of Reputable PeerS in Distributed Hash Tables

Building trust is a major concern in Peer-to-Peer networks as several kinds of applications rely on the presence of trusted services. Traditional techniques do not scale, produce very high overhead or rely on unrealistic assumptions. In this paper, we propose a new membership algorithm (CORPS) for Distributed Hash Tables which builds a community of reputable nodes and thus enables the implementation of pseudo-trusted services. CORPS uses a reputation-based approach to decide whether a node can be a member of the group or not. We demonstrate the benefits of this approach and evaluate how much it improves the reliability of a trusted routing service.